Rédei polynomials over fields of characteristic zero
نویسنده
چکیده
The possible role of Rédei polynomials over fields of characteristic zero in the quest for solutions to problems in the study of geometries and vector spaces over finite fields is discussed. This note is exploratory and does not attempt to solve any particular problem, although an example problem is considered.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملPERMUTATION POLYNOMIALS ON Fq INDUCED FROM RÉDEI FUNCTION BIJECTIONS ON SUBGROUPS OF Fq
We construct classes of permutation polynomials over FQ2 by exhibiting classes of low-degree rational functions over FQ2 which induce bijections on the set of (Q + 1)-th roots of unity. As a consequence, we prove two conjectures about permutation trinomials from a recent paper by Tu, Zeng, Hu and Li.
متن کاملDiophantine sets of polynomials over finitely generated fields in characteristic zero
Let R be a recursive noetherian integral domain of characteristic zero with fraction field K. Assume that K is finitely generated (as a field) over Q. Equivalently, assume that K is the function field of a variety over a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z]. 2000 MSC: 11D99 (primary), 03D25, 12L12, 11R58, 12E10 (secondary).
متن کاملThe Diophantine Problem for Polynomial Rings and Fields of Rational Functions1
We prove that the diophantine problem for a ring of polynomials over an integral domain of characteristic zero or for a field of rational functions over a formally real field is unsolvable.
متن کاملDirect Sum Decomposability of Polynomials and Factorization of Associated Forms
For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of the Macaulay inverse system of its Milnor algebra. This leads to an if-and-only-if criterion for direct sum decomposability of such a polynomial, and to an algorithm for computing direct sum decompositions over any field, either of characte...
متن کامل